Efficient Collision Detection Using a Dual Bounding Volume Hierarchy
نویسندگان
چکیده
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some separation axes are significantly more effective than others. We select 5 from among the 15 potential separating axes for OBBs. Experimental results show that our algorithm achieved favorable speed up with respect to the existing OBB algorithms.
منابع مشابه
CLODs: Dual Hierarchies for Multiresolution Collision Detection
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual hierarchy”, both a multiresolution representation of the original model and its bounding volume hierarchy for accelerating collision queries. We have proposed various error metrics, including object-space errors, velocity dep...
متن کاملBounding Volume Hierarchy for Avatar Collision Detection: Design Considerations
One of the most important aspects in interactive virtual environment applications is maintaining interactive frame rates while providing realistic and believable experience. Due to this fact, collision detection for interactive virtual environment applications acts as an important part of the system. However, due to its computationally intensive nature, collision detection can become a bottlene...
متن کاملEasy Realignment of k-DOP Bounding Volumes
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented ...
متن کاملA dynamic bounding volume hierarchy for generalized collision detection
In this paper, we propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object–space method is based on different ways to incrementally update the hierarchy during simulation by exploiting temporal coherence and lazy evaluation techniques. This leads to significant advantages in terms of execution speed. Further...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کامل